Randomize color signature employing locality-sensitive hashing (LSH)
نویسنده
چکیده
Visual signatures construction of images is an essential step for the CBIR system. When the database size become larger. Most existing algorithms (e.g. k-means, Kd-tree, Mean-shift) to build signature become unfavorable due to the prohibitive time and space requirements. In this paper we propose the randomize color signature based on the LSH technique. The proposed descriptor benefited of the effectiveness of LSH in terms of time and accuracy of clustering. Experiments show the effectiveness of our approach.
منابع مشابه
Multi-Level Spherical Locality Sensitive Hashing For Approximate Near Neighbors
This paper introduces “Multi-Level Spherical LSH”: parameter-free, a multi-level, data-dependant Locality Sensitive Hashing data structure for solving the Approximate Near Neighbors Problem (ANN). This data structure is a modified version multi-probe adaptive querying algorithm, with the potential of achieving a O(np + t) query run time, for all inputs n where t <= n. Keywords—Locality Sensitiv...
متن کاملAn Adaptive Multi-level Hashing Structure for Fast Approximate Similarity Search
Fast information retrieval is an essential task in data management, mainly due to the increasing availability of data. To address this problem, database researchers have developed indexing techniques to logically organize elements from large datasets in order to answer queries efficiently. In this context, an approximate similarity search algorithm known as Locality Sensitive Hashing (LSH) was ...
متن کاملSharing Hash Codes for Multiple Purposes
Locality sensitive hashing (LSH) is a powerful tool for sublinear-time approximate nearest neighbor search, and a variety of hashing schemes have been proposed for different similarity measures. However, hash codes significantly depend on the similarity, which prohibits users from adjusting the similarity at query time. In this paper, we propose multiple purpose LSH (mp-LSH) which shares the ha...
متن کاملSC-LSH: An Efficient Indexing Method for Approximate Similarity Search in High Dimensional Space
Locality Sensitive Hashing (LSH) is one of the most promising techniques for solving nearest neighbour search problem in high dimensional space. Euclidean LSH is the most popular variation of LSH that has been successfully applied in many multimedia applications. However, the Euclidean LSH presents limitations that affect structure and query performances. The main limitation of the Euclidean LS...
متن کاملSpeeding Up Neural Machine Translation Decoding by Shrinking Run-time Vocabulary
We speed up Neural Machine Translation (NMT) decoding by shrinking run-time target vocabulary. We experiment with two shrinking approaches: Locality Sensitive Hashing (LSH) and word alignments. Using the latter method, we get a 2x overall speed-up over a highly-optimized GPU implementation, without hurting BLEU. On certain low-resource language pairs, the same methods improve BLEU by 0.5 points...
متن کامل